On Stochastic Sensor Network Scheduling for Multiple Processes
نویسندگان
چکیده
منابع مشابه
On a Stochastic Algorithm for Sensor Scheduling
A stochastic algorithm for solving the sensor selection problem is presented. The problem arises when many sensors are jointly trying to estimate a process but only a subset of them can take measurements at any time step. The proposed stochastic sensor selection strategy is easy to implement and is computationally tractable. The algorithm is illustrated through simple examples of sensor schedul...
متن کاملStochastic Scheduling for Underwater Sensor Networks
The context of underwater sensor networks (UWSNs) presents special challenges for data transmission. For that context, we examine the merit of using a simple, stochastic transmission strategy based on the ALOHA protocol. The strategy uses a stochastic scheduling approach in which time is slotted, and each network node broadcasts according to some probability during each time slot. We present a ...
متن کاملScheduling parallel Kalman filters for multiple processes
In this paper, we investigate the problem of scheduling parallel Kalman filters for multiple processes, where each process is observed by a Kalman filter and at each time step only one Kalman filter could obtain observation due to practical constraints. To solve the problem, two novel notions, permissible consecutive observation loss (PCOL) and least consecutive observation (LCO), are introduce...
متن کاملComplexity Results for Wireless Sensor Network Scheduling
We study the problem of scheduling multiple sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors...
متن کاملDMP Packet Scheduling For Wireless Sensor Network
Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2017.2717193